Network Applications of Graph Bisimulation
نویسندگان
چکیده
Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free synchronising graphs and a novel notion of bisimulation equivalence which is shown to be a congruence with respect to graph composition and node restriction. We use this notion of equivalence to study some sample network applications, and show that our bisimulation equivalence captures notions like functional equivalence of logical switches, equivalence of channel implementations and level of fault tolerance of a network.
منابع مشابه
The Subgraph Bisimulation Problem
We study the complexity of the Subgraph Bisimulation Problem, which stands to Graph Bisimulation as Subgraph Isomorphism stands to Graph Isomorphism and we prove its NP-Completeness. Our analysis is motivated by its applications to Semistructured Databases.
متن کاملCayley graph associated to a semihypergroup
The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as Hamiltonian cycles in this graph. Also, by some of examples we will illustrate the properties and behavior of these Cayley graphs, in particulars we show that ...
متن کاملBisimulation Reduction of Big Graphs on MapReduce
Computing the bisimulation partition of a graph is a fundamental problem which plays a key role in a wide range of basic applications. Intuitively, two nodes in a graph are bisimilar if they share basic structural properties such as labeling and neighborhood topology. In data management, reducing a graph under bisimulation equivalence is a crucial step, e.g., for indexing the graph for efficien...
متن کاملIncremental Maintenance of Minimal Bisimulation of Cyclic Graphs
Graph-structured databases have numerous recent applications including the Semantic Web, biological databases and XML, among many others. In this paper, we study the maintenance problem of a popular structural index, namely bisimulation, of a possibly cyclic data graph. To illustrate the design of our algorithm, first, we present some challenges of bisimulation minimization of cyclic graphs. Se...
متن کاملOptimizing Incremental Maintenance of Minimal Bisimulation of Cyclic Graphs
Graph-structured databases have numerous recent applications including the Semantic Web, biological databases and XML, among many others. In this paper, we study the maintenance problem of a popular structural index, namely bisimulation, of a possibly cyclic data graph. In comparison, previous work mainly focuses on acyclic graphs. In the context of database applications, it is natural to compu...
متن کامل